1709B - Also Try Minecraft - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define MOD 998244353
#define MAX 2147483647
#define fin(i,a,b) for(int i=a;i<b;i++)
#define fdec(i,a,b) for(int i=a;i>b;i--)
#define ve(n) vector<int> v(n);
#define pr(x,y) make_pair(x,y);
bool sortbysec(const pair<int,int> &a,
  const pair<int,int> &b);

bool sortbysec(const pair<int,int> &a,
  const pair<int,int> &b)
{
    return (a.second < b.second);
}
void printVector(vector<int> v){
    for(auto i:v){
        cout<<i<<" ";
    }
    cout<<endl;
}

void printMap(map<int,int>mp){
    for(auto i:mp){
        cout<<i.first<<" -> "<<i.second<<endl;
    }
}

int factorial(int n){
    int f = 1;
    for(int i=2;i<=n;i++){
        f=(f*i)%MOD;
    }
    return f;
}

bool isPowerOfTwo(int n)
{
    if (n == 0)
        return false;

    return (ceil(log2(n)) == floor(log2(n)));
}

int gcd(int a, int b)
{
  if (a == 0)
    return b;
return gcd(b % a, a);
}

int lcm(int a, int b){
    return (a*b)/(__gcd(a,b));
}

int arrGCD(vector<int> v, int n)
{
  int result = v[0];
  for (int i = 1; i < n; i++)
  {
    result = gcd(v[i], result);

    if(result == 1)
    {
        return 1;
    }
}
return result;
}

vector<int> primeFactorization(int n) {
    vector<int> pf;
    while (n%2 == 0){
      pf.push_back(2);
      n = n/2;
  }
  for (int i = 3; i <= sqrt(n); i = i+2){
      while (n%i == 0){
        pf.push_back(i);
        n = n/i;
    }
}
if (n > 2)
  pf.push_back(n);
return pf;
}

int sumOfDigits(int n){
    int sum=0;
    while(n>0){
        sum+=n%10;
        n/=10;
    }
    return sum;
}

int countDigit(int n) {
  return floor(log10(n) + 1);
}

vector<int> decToBinary(int n)
{
    vector<int> binaryNum(32);
    int i = 0;
    while (n > 0) {
        binaryNum[i] = n % 2;
        n = n / 2;
        i++;
    }
    return binaryNum;
}

void solve(){
    int n,m;
    cin>>n>>m;
    ve(n);
    fin(i,0,n){
        cin>>v[i];
    }
    int sum=0;
    vector<int>l(n);
    l[0] = 0;
    fin(i,1,n){
        if(v[i-1]>v[i]){
            sum+=v[i-1]-v[i];
        }
        l[i] = sum;
    }
    int s2=0;
    vector<int>r(n);
    r[n-1] = 0;
    for(int i=n-2;i>=0;i--){
        if(v[i]<v[i+1]){
            s2+=v[i+1]-v[i];
        }
        r[i] = s2;
    }
    fin(i,0,m){
        int x,y;
        cin>>x>>y;
        if(y>=x){
            cout<<l[y-1]-l[x-1]<<endl;
        } else {
            cout<<r[y-1]-r[x-1]<<endl;
        }
    }
}


int32_t main() {
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r",stdin); 
    freopen("output.txt", "w",stdout);
    #endif
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    /*int t;
    cin>>t;
    while(t--)
    {
        solve();
    }*/
    solve();

    return 0;
}